Skeleton-Based Seam Computation for Triangulated Surface Parameterization
نویسندگان
چکیده
Mesh parameterization is a key problem in digital geometry processing. By cutting a surface along a set of edges (a seam), one can map an arbitrary topology surface mesh to a single chart. Unfortunately, high distortion occurs when protrusions of the surface (such as fingers of a hand and horses’ legs) are flattened into a plane. This paper presents a novel skeleton-based algorithm for computing a seam on a triangulated surface. The seam produced is a full component Steiner tree in a graph constructed from the original mesh. By generating the seam so that all extremal vertices are leaves of the seam, we can obtain good parametrization with low distortion.
منابع مشابه
Spanning Tree Seams for Reducing Parameterization Distortion of Triangulated Surfaces (figures 4, 5, and 6)
Providing a two-dimensional parameterization of threedimensional tesselated surfaces is beneficial to many applications in computer graphics, finite-element surface meshing, surface reconstruction and other areas. The applicability of the parameterization depends on how well it preserves the surface metric structures (angles, distances, areas). For a general surface there is no mapping which fu...
متن کاملAutomatic Image Retargeting Using Saliency Based Mesh Parameterization
Automatic image retargeting is used for large image.That are to be fit in small size display devices. Without any loss of information.our proposed methods one is saliency based mesh parameterization method is used to retarget the image. Stretch-Based Mesh Parameterization is generating on saliency image. GraphBased visual saliency is used to easily find out the objects in the image. Mesh Genera...
متن کاملGeodesic Computations for Fast and Accurate Surface Remeshing and Parameterization
In this paper, we propose fast and accurate algorithms to remesh and flatten a genus-0 triangulated manifold. These methods naturally fits into a framework for 3D geometry modeling and processing that uses only fast geodesic computations. These techniques are gathered and extended from classical areas such as image processing or statistical perceptual learning. Using the Fast Marching algorithm...
متن کاملParameterization of Triangular Meshes with Virtual Boundaries
Parameterization of a 3D triangular mesh is a fundamental problem in mesh processing, such as texture mapping, multiresolution modeling, and smooth surface fitting. The convex combination approach is widely used for parameterization because it has good properties such as fast computation and little distortion of embedded triangles. However, the approach has one drawback: most boundary triangles...
متن کاملHierarchy of Surface Models and Irreducible Triangulation
Given a triangulated closed surface, the problem of constructing a hierarchy of surface models of decreasing level of detail has attracted much attention in computer graphics. A hierarchy provides viewdependent refinement and facilitates the computation of parameterization. For a triangulated closed surface of vertices and genus , we prove that there is a constant such that if , a greedy strate...
متن کامل